Stabilizing decompositions of sigma
نویسندگان
چکیده
منابع مشابه
Adaptive splitting for stabilizing 1-D wavelet decompositions on irregular grids
This paper proposes a scheme to improve the stability of wavelet decompositions on 1-D irregular grids. Wavelet transforms on irregular grids are constructed using the lifting scheme. The filters in this scheme take the structure of the grid into account. Nice as it is, however, we undoubtfully bump into numerical stability issues directly related to the irregularity of the grid. Existing stabi...
متن کاملInfinite-dimensional versions of the primary, cyclic and Jordan decompositions
The famous primary and cyclic decomposition theorems along with the tightly related rational and Jordan canonical forms are extended to linear spaces of infinite dimensions with counterexamples showing the scope of extensions.
متن کامل“Stabilizing” the stabilizing controllers
The main purpose of this paper is to revisit the internal/simultaneous/robust stabilization problems without assuming the existence of doubly coprime factorizations for the transfer matrices. Indeed, it has been recently shown in the literature that an internally stabilizable does not generally admit doubly coprime factorizations. Firstly, we give new necessary and sufficient conditions for int...
متن کاملOn nuclei of sup-$Sigma$-algebras
In this paper, algebraic investigations on sup-$Sigma$-algebras are presented. A representation theorem for sup-$Sigma$-algebras in terms of nuclei and quotients is obtained. Consequently, the relationship between the congruence lattice of a sup-$Sigma$-algebra and the lattice of its nuclei is fully developed.
متن کاملFinding Branch-Decompositions and Rank-Decompositions
We present a new algorithm that can output the rank-decomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outputs its branch-decomposition of width at most k if such exists. This algorithm works also for partitioned matroids. Both these algorithms are fixed-parameter tractable, that is, they run...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 1990
ISSN: 0166-8641
DOI: 10.1016/0166-8641(90)90016-u